<title>Way Selection</title><link href="http://hzoi.com/tomorrow.css" rel="stylesheet"><div class="ui existing segment"><pre><code><span class="pl-cp">#include</span> <span class="pl-cpf">&lt;bits/stdc++.h&gt;</span><span class="pl-cp"></span>
<span class="pl-k">using</span> <span class="pl-k">namespace</span> <span class="pl-n">std</span><span class="pl-p">;</span>
<span class="pl-k">const</span> <span class="pl-kt">int</span> <span class="pl-n">inf</span> <span class="pl-o">=</span> <span class="pl-mh">0x3f3f3f3f</span><span class="pl-p">,</span> <span class="pl-n">N</span> <span class="pl-o">=</span> <span class="pl-mi">1010</span><span class="pl-p">;</span>
<span class="pl-kt">int</span> <span class="pl-n">n</span><span class="pl-p">,</span> <span class="pl-n">m</span><span class="pl-p">,</span> <span class="pl-n">t</span><span class="pl-p">,</span> <span class="pl-n">match</span><span class="pl-p">[</span><span class="pl-n">N</span><span class="pl-p">],</span> <span class="pl-n">ans</span> <span class="pl-o">=</span> <span class="pl-mi">0</span><span class="pl-p">,</span> <span class="pl-n">h</span><span class="pl-p">[</span><span class="pl-n">N</span><span class="pl-p">],</span> <span class="pl-n">num</span> <span class="pl-o">=</span> <span class="pl-mi">0</span><span class="pl-p">;</span>
<span class="pl-kt">bool</span> <span class="pl-n">vis</span><span class="pl-p">[</span><span class="pl-n">N</span><span class="pl-p">];</span>
<span class="pl-k">struct</span> <span class="pl-n">point</span> <span class="pl-p">{</span> <span class="pl-kt">double</span> <span class="pl-n">x</span><span class="pl-p">,</span> <span class="pl-n">y</span><span class="pl-p">;</span> <span class="pl-p">}</span> <span class="pl-n">p</span><span class="pl-p">[</span><span class="pl-n">N</span><span class="pl-p">];</span>
<span class="pl-k">struct</span> <span class="pl-n">edge</span> <span class="pl-p">{</span> <span class="pl-kt">int</span> <span class="pl-n">to</span><span class="pl-p">,</span> <span class="pl-n">next</span><span class="pl-p">;</span> <span class="pl-p">}</span> <span class="pl-n">edges</span><span class="pl-p">[</span><span class="pl-n">N</span> <span class="pl-o">*</span> <span class="pl-n">N</span><span class="pl-p">];</span>
<span class="pl-kt">bool</span> <span class="pl-nf">find</span><span class="pl-p">(</span><span class="pl-kt">int</span> <span class="pl-n">x</span><span class="pl-p">)</span> <span class="pl-p">{</span>
    <span class="pl-k">for</span> <span class="pl-p">(</span><span class="pl-kt">int</span> <span class="pl-n">i</span> <span class="pl-o">=</span> <span class="pl-n">h</span><span class="pl-p">[</span><span class="pl-n">x</span><span class="pl-p">];</span> <span class="pl-n">i</span><span class="pl-p">;</span> <span class="pl-n">i</span> <span class="pl-o">=</span> <span class="pl-n">edges</span><span class="pl-p">[</span><span class="pl-n">i</span><span class="pl-p">].</span><span class="pl-n">next</span><span class="pl-p">)</span> <span class="pl-p">{</span>
        <span class="pl-kt">int</span> <span class="pl-n">y</span> <span class="pl-o">=</span> <span class="pl-n">edges</span><span class="pl-p">[</span><span class="pl-n">i</span><span class="pl-p">].</span><span class="pl-n">to</span><span class="pl-p">;</span>
        <span class="pl-k">if</span> <span class="pl-p">(</span><span class="pl-n">vis</span><span class="pl-p">[</span><span class="pl-n">y</span><span class="pl-p">])</span> <span class="pl-k">continue</span><span class="pl-p">;</span>
        <span class="pl-n">vis</span><span class="pl-p">[</span><span class="pl-n">y</span><span class="pl-p">]</span> <span class="pl-o">=</span> <span class="pl-mi">1</span><span class="pl-p">;</span>
        <span class="pl-k">if</span> <span class="pl-p">(</span><span class="pl-o">!</span><span class="pl-n">match</span><span class="pl-p">[</span><span class="pl-n">y</span><span class="pl-p">]</span> <span class="pl-o">||</span> <span class="pl-n">find</span><span class="pl-p">(</span><span class="pl-n">match</span><span class="pl-p">[</span><span class="pl-n">y</span><span class="pl-p">]))</span> <span class="pl-p">{</span>
            <span class="pl-n">match</span><span class="pl-p">[</span><span class="pl-n">y</span><span class="pl-p">]</span> <span class="pl-o">=</span> <span class="pl-n">x</span><span class="pl-p">;</span>
            <span class="pl-k">return</span> <span class="pl-mi">1</span><span class="pl-p">;</span>
        <span class="pl-p">}</span>
    <span class="pl-p">}</span>
    <span class="pl-k">return</span> <span class="pl-mi">0</span><span class="pl-p">;</span>
<span class="pl-p">}</span>
<span class="pl-kt">int</span> <span class="pl-nf">main</span><span class="pl-p">()</span> <span class="pl-p">{</span>
    <span class="pl-k">while</span> <span class="pl-p">(</span><span class="pl-o">~</span><span class="pl-n">scanf</span><span class="pl-p">(</span><span class="pl-s">&quot;%d%d%d&quot;</span><span class="pl-p">,</span> <span class="pl-o">&amp;</span><span class="pl-n">n</span><span class="pl-p">,</span> <span class="pl-o">&amp;</span><span class="pl-n">m</span><span class="pl-p">,</span> <span class="pl-o">&amp;</span><span class="pl-n">t</span><span class="pl-p">))</span> <span class="pl-p">{</span>
        <span class="pl-n">num</span> <span class="pl-o">=</span> <span class="pl-mi">0</span><span class="pl-p">;</span>
        <span class="pl-n">memset</span><span class="pl-p">(</span><span class="pl-n">h</span><span class="pl-p">,</span> <span class="pl-mi">0</span><span class="pl-p">,</span> <span class="pl-k">sizeof</span><span class="pl-p">(</span><span class="pl-n">h</span><span class="pl-p">));</span>
        <span class="pl-k">for</span> <span class="pl-p">(</span><span class="pl-kt">int</span> <span class="pl-n">i</span> <span class="pl-o">=</span> <span class="pl-mi">1</span><span class="pl-p">;</span> <span class="pl-n">i</span> <span class="pl-o">&lt;=</span> <span class="pl-n">m</span><span class="pl-p">;</span> <span class="pl-o">++</span><span class="pl-n">i</span><span class="pl-p">)</span> <span class="pl-n">scanf</span><span class="pl-p">(</span><span class="pl-s">&quot;%lf%lf&quot;</span><span class="pl-p">,</span> <span class="pl-o">&amp;</span><span class="pl-n">p</span><span class="pl-p">[</span><span class="pl-n">i</span><span class="pl-p">].</span><span class="pl-n">x</span><span class="pl-p">,</span> <span class="pl-o">&amp;</span><span class="pl-n">p</span><span class="pl-p">[</span><span class="pl-n">i</span><span class="pl-p">].</span><span class="pl-n">y</span><span class="pl-p">);</span>
        <span class="pl-k">for</span> <span class="pl-p">(</span><span class="pl-kt">int</span> <span class="pl-n">i</span> <span class="pl-o">=</span> <span class="pl-mi">1</span><span class="pl-p">;</span> <span class="pl-n">i</span> <span class="pl-o">&lt;=</span> <span class="pl-n">n</span><span class="pl-p">;</span> <span class="pl-o">++</span><span class="pl-n">i</span><span class="pl-p">)</span> <span class="pl-p">{</span>
            <span class="pl-kt">double</span> <span class="pl-n">x</span><span class="pl-p">,</span> <span class="pl-n">y</span><span class="pl-p">,</span> <span class="pl-n">v</span><span class="pl-p">;</span>
            <span class="pl-n">scanf</span><span class="pl-p">(</span><span class="pl-s">&quot;%lf%lf%lf&quot;</span><span class="pl-p">,</span> <span class="pl-o">&amp;</span><span class="pl-n">x</span><span class="pl-p">,</span> <span class="pl-o">&amp;</span><span class="pl-n">y</span><span class="pl-p">,</span> <span class="pl-o">&amp;</span><span class="pl-n">v</span><span class="pl-p">);</span>
            <span class="pl-k">for</span> <span class="pl-p">(</span><span class="pl-kt">int</span> <span class="pl-n">j</span> <span class="pl-o">=</span> <span class="pl-mi">1</span><span class="pl-p">;</span> <span class="pl-n">j</span> <span class="pl-o">&lt;=</span> <span class="pl-n">m</span><span class="pl-p">;</span> <span class="pl-o">++</span><span class="pl-n">j</span><span class="pl-p">)</span> <span class="pl-p">{</span>
                <span class="pl-k">if</span> <span class="pl-p">((</span><span class="pl-n">x</span> <span class="pl-o">-</span> <span class="pl-n">p</span><span class="pl-p">[</span><span class="pl-n">j</span><span class="pl-p">].</span><span class="pl-n">x</span><span class="pl-p">)</span> <span class="pl-o">*</span> <span class="pl-p">(</span><span class="pl-n">x</span> <span class="pl-o">-</span> <span class="pl-n">p</span><span class="pl-p">[</span><span class="pl-n">j</span><span class="pl-p">].</span><span class="pl-n">x</span><span class="pl-p">)</span> <span class="pl-o">+</span> <span class="pl-p">(</span><span class="pl-n">y</span> <span class="pl-o">-</span> <span class="pl-n">p</span><span class="pl-p">[</span><span class="pl-n">j</span><span class="pl-p">].</span><span class="pl-n">y</span><span class="pl-p">)</span> <span class="pl-o">*</span> <span class="pl-p">(</span><span class="pl-n">y</span> <span class="pl-o">-</span> <span class="pl-n">p</span><span class="pl-p">[</span><span class="pl-n">j</span><span class="pl-p">].</span><span class="pl-n">y</span><span class="pl-p">)</span> <span class="pl-o">&gt;</span> <span class="pl-n">v</span> <span class="pl-o">*</span> <span class="pl-n">t</span> <span class="pl-o">*</span> <span class="pl-n">v</span> <span class="pl-o">*</span> <span class="pl-n">t</span><span class="pl-p">)</span> <span class="pl-k">continue</span><span class="pl-p">;</span>
                <span class="pl-n">edges</span><span class="pl-p">[</span><span class="pl-o">++</span><span class="pl-n">num</span><span class="pl-p">].</span><span class="pl-n">to</span> <span class="pl-o">=</span> <span class="pl-n">j</span><span class="pl-p">;</span>
                <span class="pl-n">edges</span><span class="pl-p">[</span><span class="pl-n">num</span><span class="pl-p">].</span><span class="pl-n">next</span> <span class="pl-o">=</span> <span class="pl-n">h</span><span class="pl-p">[</span><span class="pl-n">i</span><span class="pl-p">];</span>
                <span class="pl-n">h</span><span class="pl-p">[</span><span class="pl-n">i</span><span class="pl-p">]</span> <span class="pl-o">=</span> <span class="pl-n">num</span><span class="pl-p">;</span>
            <span class="pl-p">}</span>
        <span class="pl-p">}</span>
        <span class="pl-k">for</span> <span class="pl-p">(</span><span class="pl-kt">int</span> <span class="pl-n">i</span> <span class="pl-o">=</span> <span class="pl-mi">1</span><span class="pl-p">;</span> <span class="pl-n">i</span> <span class="pl-o">&lt;=</span> <span class="pl-n">n</span><span class="pl-p">;</span> <span class="pl-o">++</span><span class="pl-n">i</span><span class="pl-p">)</span> <span class="pl-p">{</span>
            <span class="pl-n">memset</span><span class="pl-p">(</span><span class="pl-n">vis</span><span class="pl-p">,</span> <span class="pl-mi">0</span><span class="pl-p">,</span> <span class="pl-k">sizeof</span><span class="pl-p">(</span><span class="pl-n">vis</span><span class="pl-p">));</span>
            <span class="pl-k">if</span> <span class="pl-p">(</span><span class="pl-n">find</span><span class="pl-p">(</span><span class="pl-n">i</span><span class="pl-p">))</span> <span class="pl-n">ans</span><span class="pl-o">++</span><span class="pl-p">;</span>
        <span class="pl-p">}</span>
        <span class="pl-n">printf</span><span class="pl-p">(</span><span class="pl-s">&quot;%d</span><span class="pl-se">\n</span><span class="pl-s">&quot;</span><span class="pl-p">,</span> <span class="pl-n">ans</span><span class="pl-p">);</span>
    <span class="pl-p">}</span>
    <span class="pl-k">return</span> <span class="pl-mi">0</span><span class="pl-p">;</span>
<span class="pl-p">}</span>
</cpde></pre></div>